A Short Note on Perfectly Balanced Binary Search Trees
نویسندگان
چکیده
منابع مشابه
Simple Balanced Binary Search Trees
Efficient implementations of sets and maps (dictionaries) are important in computer science, and balanced binary search trees are the basis of the best practical implementations. Pedagogically, however, they are often quite complicated, especially with respect to deletion. I present complete code (with justification and analysis not previously available in the literature) for a purely-functiona...
متن کاملA New Class of Balanced Search Trees: Half Balanced Binary Search Trees
— A newclassojbalancedbinary search trees is introduced: thehalf-balancedbinary trees. When used as a node search tree, a hal]-balanced binary tree containing n keys has a height at most 2 lg(n + 2) —2. Algorithms are given for IN SERT and DELETE instructions, having time complexity O(lg n). A remarkable resuit is that at most one local restructuring must be performed during the (leletion or th...
متن کاملA Fibonacci Theme on Balanced Binary Trees
In this paper we show that, when a binary tree is in a certain critical balance, there emerge the Golden Ratio and the Fibonacci numbers. The paper consists of two sections. In the first section we find some elementary balance properties of optimal binary trees with variously weighted leaves. In the second section, a basic inequality implied by the optimality of trees is in turn used to define ...
متن کاملOn Digital Search Trees - A Simple Method for Constructing Balanced Binary Trees
This paper presents digital search trees, a binary tree data structure that can produce well-balanced trees in the majority of cases. Digital search tree algorithms are reviewed, and a novel algorithm for building sorted trees is introduced. It was found that digital search trees are simple to implement because their code is similar to the code for ordinary binary search trees. Experimental eva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1992
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/35.6.660